Minisum and maximin aerial surveillance over disjoint rectangles

The Maximum Disjoint Set of Boundary Rectangles

We consider the problem of finding a maximum disjoint set of boundary rectangles, where all rectangles are attached to the boundary of a bounding box. We present an algorithm for solving the problem in O(n) time, improving upon the best previous O(n)-time solution available for the problem.

Locating a Semi-Obnoxious Facility on a Network with the Elliptic Maximin and Network Minisum Objectives

Covering a Point Set by Two Disjoint Rectangles

Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pair of disjoint rectangles such that their union contains S and the area of the larger rectangle is minimized. In this paper we consider two variants of this optimization problem: (1) the rectangles are free to rotate but must remain parallel to each other, and (2) one rectangle is axis-parallel bu...

Aerial Video Surveillance and Exploitation

There is growing interest in performing aerial surveillance using video cameras. Compared to traditional framing cameras, videos provide the capability to observe ongoing activity within a scene and to automatically control the camera to track the activity. However, the high data rates and relatively small field of view of videos present new technical challenges that must be overcome before vid...

Bargaining over multiple issues with maximin and leximin preferences

Global bargaining problems over a finite number of different issues are formalized as cartesian products of classical bargaining problems. For maximin and leximin bargainers we characterize global bargaining solutions that are efficient and satisfy the requirement that bargaining separately or globally leads to equivalent outcomes. Global solutions in this class are constructed from the family ...